Counting Unlabelled Subtrees of a Tree Is #p-complete
نویسندگان
چکیده
The problem of counting unlabelled subtrees of a tree (that is, subtrees that are distinct up to isomorphism) is #P-complete, and hence equivalent in computational difficulty to evaluating the permanent of a 0,1-matrix.
منابع مشابه
Number of complete N-ary subtrees on Galton-Watson family trees
We associate with a Bienaymé-Galton-Watson branching process a family tree rooted at the ancestor. For a positive integer N , define a complete N -ary tree to be the family tree of a deterministic branching process with offspring generating function s . We study the random variables VN,n and VN counting the number of disjoint complete N -ary subtrees, rooted at the ancestor, and having height n...
متن کاملComputational aspects of mining maximal frequent patterns
In this paper we study the complexity-theoretic aspects of mining maximal frequent patterns, from the perspective of counting the number of all distinct solutions. We present the first formal proof that the problem of counting the number of maximal frequent itemsets in a database of transactions, given an arbitrary support threshold, is #P-complete, thereby providing theoretical evidence that t...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملLimit laws for functions of fringe trees for binary search trees and random recursive trees
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees and random recursive trees. The proofs use a new version of a representation by Devroye, and Stein’s method for both normal and Poisson approximation together with certain couplings. As a consequence, we give simple new proofs of the fact that the number of fringe trees of size k = kn in the binary...
متن کاملVarro: An Algorithm and Toolkit for Regular Structure Discovery in Treebanks
The Varro toolkit is a system for identifying and counting a major class of regularity in treebanks and annotated natural language data in the form of treestructures: frequently recurring unordered subtrees. This software has been designed for use in linguistics to be maximally applicable to actually existing treebanks and other stores of tree-structurable natural language data. It minimizes me...
متن کامل